On Some Universal Propositional Proof Systems for Many-Valued Logic
نویسندگان
چکیده
منابع مشابه
Proof Systems for Effectively Propositional Logic
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refutations than resolution for this logic. This shows that methods based on ground instantiation may be weaker than non-ground methods. Second, we introduce a generalisation rule for effectively propositional logic and sho...
متن کاملA Tutorial on St Almarck's Proof Procedure for Propositional Logic a Tutorial on St Almarck's Proof Procedure for Propositional Logic
We explain St almarck's proof procedure for classical propo-sitional logic. The method is implemented in a commercial tool that has been used successfully in real industrial veriication projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the large formulas encountered in industrial-scale...
متن کاملOptimal Proof Systems for Propositional Logic and Complete Sets
A polynomial time computable function h : ! whose range is the set of tau-tologies in Propositional Logic (TAUT), is called a proof system. Cook and Reckhow deened this concept in 6] and in order to compare the relative strength of diierent proof systems, they considered the notion of p-simulation. Intuitively a proof system h p-simulates a second one h 0 if there is a polynomial time computabl...
متن کاملSome Proof Theoretic Considerations in Intuitionistic Propositional Modal Logic
Formalizations of different logics can serve as foundations for reasoning about various properties of both hardware and software systems. Intuitionistic modal logics, featuring operators encoding possibility and necessity, have recently found applications in hardware verification as well as proposed type systems for staged computation and distributed computing. We propose several novel sequent ...
متن کاملMany-valued hybrid logic
In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is prooftheoretically well-behaved, in particular, it gives rise to a decision procedure for the logic. This shows that many-valued hybrid logics is a natural enterprise and opens up the way for future applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems of Computer Science
سال: 2020
ISSN: 2579-2784
DOI: 10.51408/1963-0049